Location:
Search - chess horse
Search list
Description: 求解骑士游历问题的程序。骑士游历问题是在8X8格的国际象棋棋盘上随意放置一个马，按照马走“日”字的规则对马进行操作，问是否能够不重复的走遍棋盘的每个格。-Cavaliers traveled problem solving process. Cleveland traveled problem is the 8x8 grid of international chess pieces on dumped a horse, according to Ma take "days" to the rules word for horse operations, asked whether not to repeat the chessboard visited each grid.
Platform: |
Size: 15292 |
Author: wangyanfang |
Hits:
Description: 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a horse like chess, only two horizontal lattice, a vertical or horizontal one lattice lattice, two vertical lattice (but chess piece must be placed on the lattice), with a further two species go, The second step will take five species law. this is a 5 * 5 chessboard, and the Knights up in the upper left corner, the first step (0, 0) position and try to find a path, Knight to make the 25-step within the remaining 24 locations completed all. Output results, Knight will be on display on the path of the 5 * 5 box, Each box shows left here for the first box synchronization figures.
Platform: |
Size: 3964 |
Author: tongyaozhang |
Hits:
Description: 骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n * n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vertical, horizontal or a vertical two-step further vaulting horse rules traveled a checkerboard lattice of each and every one lattice just take time.
Platform: |
Size: 1357 |
Author: 张三 |
Hits:
Description: a game simulate the horse chess (about artificial intelligence)
Platform: |
Size: 18601 |
Author: selena |
Hits:
Description: 马踏棋盘问题：国际象棋中的马，怎样才能不重复的跳遍棋盘上的每一格呢？ 笔者见过许多解决这类问题的程序，这个是最简洁同时也是速度最快的一个。-horse riding chessboard : the international chess Ma, how can we not repeat the jump all over the chessboard of each? I met many issues to resolve such procedures, this is the most succinct is also the fastest one.
Platform: |
Size: 8396 |
Author: 寒冬 |
Hits:
Description: 马踏棋盘问题：国际象棋中的马，怎样才能不重复的跳遍棋盘上的每一格呢？ 笔者见过许多解决这类问题的程序，这个是最简洁同时也是速度最快的一个。-horse riding chessboard : the international chess Ma, how can we not repeat the jump all over the chessboard of each? I met many issues to resolve such procedures, this is the most succinct is also the fastest one.
Platform: |
Size: 8192 |
Author: 寒冬 |
Hits:
Description: 求解骑士游历问题的程序。骑士游历问题是在8X8格的国际象棋棋盘上随意放置一个马，按照马走“日”字的规则对马进行操作，问是否能够不重复的走遍棋盘的每个格。-Cavaliers traveled problem solving process. Cleveland traveled problem is the 8x8 grid of international chess pieces on dumped a horse, according to Ma take "days" to the rules word for horse operations, asked whether not to repeat the chessboard visited each grid.
Platform: |
Size: 15360 |
Author: |
Hits:
Description: 有多种方法喔!西洋棋中骑士的走法与象棋的马类似,只能横向二格,纵向一格或者横向一格,纵向两格(但是西洋棋棋子必须放在格子中),第1步有2种走法,第二步就有5种走法.今有5*5的棋盘,并将骑士的第一步放于左上角(0,0)的位置,试找出一个路径,使骑士在25步内把剩下的24个位置全部走完.输出结果时,将骑士的路径显示于的5*5的方格中,每一方格内显示出走到此方格内为第同步的数字. -are many ways! Chinese chess knight of the law and take a horse like chess, only two horizontal lattice, a vertical or horizontal one lattice lattice, two vertical lattice (but chess piece must be placed on the lattice), with a further two species go, The second step will take five species law. this is a 5* 5 chessboard, and the Knights up in the upper left corner, the first step (0, 0) position and try to find a path, Knight to make the 25-step within the remaining 24 locations completed all. Output results, Knight will be on display on the path of the 5* 5 box, Each box shows left here for the first box synchronization figures.
Platform: |
Size: 4096 |
Author: tongyaozhang |
Hits:
Description: 1． 本程序演示在国际象棋中马在8×8的棋盘中的任一个方格,按马走棋规则进行移动,每个方格只进入一次,走遍盘上全部64个方格,将求得的路线用数字表示在一个8×8的方阵中,并输出这个方阵-1. Demonstration of this procedure in the international chess China and Malaysia in 8 × 8 chessboard in any one box, according to the rules of horse moves the mobile, each box to enter only once every 64 plate full grid will be obtained line with the figures that in a 8 × 8 square, and the output of the square
Platform: |
Size: 35840 |
Author: 鱼鱼 |
Hits:
Description: 骑士遍历问题，在一个n*n个方格的国际象棋棋盘上，马（骑士）从任意指定方格出发，按照横1 步竖2 步，或横2 步竖1步的跳马规则，走遍棋盘的每一个格子，且每个格子只走1次。-Knight, in an n* n box at the international chess board, Ma (Knight) from the arbitrary designation box and, in accordance with a further horizontal two-step vertical, horizontal or a vertical two-step further vaulting horse rules traveled a checkerboard lattice of each and every one lattice just take time.
Platform: |
Size: 1024 |
Author: 张三 |
Hits:
Description: 马的遍历问题。在中国象棋棋盘上，对任一位置上放置的一个马，均能选择合适的路线，使得该棋子能够按象棋的规则不重复的走过棋盘上的每一个位置。-Traversal problem horses. In Chinese chess chessboard, for any one location to place a horse, able to choose the right line, making the chess pieces according to chess rules can not repeat the past chessboard for each location.
Platform: |
Size: 167936 |
Author: yellowdoo |
Hits:
Description: 马踏棋盘的源程序！实现国际象棋中马走遍整个棋盘！-Horse riding board source! Sino-Malaysian Chess realize traveled the entire board!
Platform: |
Size: 2048 |
Author: 唐冲 |
Hits:
Description: 八皇后问题是大数学家高斯于1850年提出来的。该问题是在8×8的国际象棋棋盘上放置8个皇后，使得没有一个皇后能"吃掉"任何其他一个皇后，即没有任何两个皇后被放置在棋盘的同一行、同一列或同一斜线上。要求编一个程序求出该问题的所有解。骑士游历问题是放在8×8的国际象棋棋盘上的一个马，按照马走"日"字的规则是否能够不重复地走遍棋盘的每个格。要求编一个程序求出该问题的一个解。-Eight Queen s question is the main mathematician Gauss was put forward in 1850. The problem is in the 8 × 8 chess board to place eight queen, making no one s able to eat any other a queen, that is, no two queen was placed in the chessboard of the same line, the same row or the same oblique online. Asked for a procedure to derive all the solutions of the problem. The problem is Cavalier traveled on 8 × 8 chess board on a horse, in accordance with the horse to the Day of the rules of the word can not be repeated for each cell traveled chessboard. Asked for a procedure to derive a solution of the problem.
Platform: |
Size: 2048 |
Author: 夏鑫 |
Hits:
Description: 马踏棋盘的程序设计
设计一个国际象棋的马踏遍棋盘的演示程序。
将马随机放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则（见题集p98）进行移动。要求每个方格只进入一次，走边棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,3,…,64依次填入一个8×8的方阵，输出之。
-Horse riding programming board to design a chess board horses all over the demo program. Ma Random Chess on the 8 × 8 chessboard Board [8] [8] of a box, the horse moves in accordance with the rules (see title set p98) mobile. Requires each box to enter only once, take the side of the chessboard of 64 squares total. The preparation of non-recursive procedures, and run routes, and routes are obtained, the number 1,2,3, ..., 64 followed by an 8 × 8 filled the square, the output of.
Platform: |
Size: 50176 |
Author: 耗子 |
Hits:
Description: a game simulate the horse chess (about artificial intelligence)
Platform: |
Size: 77824 |
Author: selena |
Hits:
Description: 求马的哈密顿回路,在国际相棋棋局上,一只马要经过每个点,且仅经过一次,棋局可以是非常大,要求输出马经过的所有点及路径.-Hamiltonian circuit for the horse in the international chess game of chess, the one horse to go through each point, and only after one game can be very large and require output horse after all the point and path.
Platform: |
Size: 1030144 |
Author: lin |
Hits:
Description: 在n x n棋盘（有n x n个格点的棋盘）的某个格点上有一个中国象棋马，马走日字。求一条周游棋盘的路径，使得马能够从起始位置起沿着该路径每个格点恰好走一次最后回到出发位置。-In the chessboard are like (have are like a checkerboard grid points) of a grid, there is a Chinese chess Ma, Ma date the word go. Seek a path around the board, making horse to starting from the initial position along the path happens to go for each grid point a final return to the starting position.
Platform: |
Size: 1894400 |
Author: kineapple |
Hits:
Description: 将马随即放在国际象棋的8×8棋盘Board[8][8]的某个方格中，马按走棋规则进行移动。要求每个方格只进入一次，走遍棋盘上全部64个方格。编制非递归程序，求出马的行走路线，并按求出的行走路线，将数字1,2,……,64依次填入一个8×8的方阵，输出之。
测试数据：由读者指定。可自行指定一个马的初始位置(i,j),0<=i,j<=7。-Ma was on the chess board 8 × 8 of the Board [8] [8] on a grid, Ma moves in accordance with the rules of the mobile. Requires each box to enter only once, all around the chessboard of 64 squares. The preparation of non-recursive procedures, and run routes, and obtained routes, the number 1,2, ... ..., 64 followed by an 8 × 8 filled the square, the output of. Test data: designated by the readers. Self-designation of a horse s initial position (i, j), 0 <= i, j <= 7.
Platform: |
Size: 22528 |
Author: gaoliming |
Hits:
Description: 实现了马可以走动吃点兵的功能和棋盘的分布(The horse can walk to eat the distribution function and the board.)
Platform: |
Size: 231424 |
Author: 花花和
|
Hits:
Description: 有一m*n的棋盘(即棋盘由m行和n列)，一马放在棋盘中任意位置，马按中国象棋跳法，从初始位置起跳，跳至边界后返回，求所有能返回初始位置的周游路线。(A m*n board (the board consists of M rows and N columns), a horse placed anywhere in the board, according to the China chess horse jump method, from the initial position jump, jump to the border after the return, all can return to the initial position of the travel route.)
Platform: |
Size: 1024 |
Author: b123A
|
Hits: